全文获取类型
收费全文 | 3192篇 |
免费 | 337篇 |
国内免费 | 470篇 |
专业分类
化学 | 2098篇 |
晶体学 | 21篇 |
力学 | 111篇 |
综合类 | 88篇 |
数学 | 879篇 |
物理学 | 802篇 |
出版年
2024年 | 22篇 |
2023年 | 181篇 |
2022年 | 381篇 |
2021年 | 528篇 |
2020年 | 387篇 |
2019年 | 277篇 |
2018年 | 189篇 |
2017年 | 187篇 |
2016年 | 198篇 |
2015年 | 139篇 |
2014年 | 190篇 |
2013年 | 258篇 |
2012年 | 132篇 |
2011年 | 109篇 |
2010年 | 98篇 |
2009年 | 102篇 |
2008年 | 92篇 |
2007年 | 107篇 |
2006年 | 67篇 |
2005年 | 53篇 |
2004年 | 46篇 |
2003年 | 36篇 |
2002年 | 26篇 |
2001年 | 15篇 |
2000年 | 27篇 |
1999年 | 13篇 |
1998年 | 10篇 |
1997年 | 19篇 |
1996年 | 15篇 |
1995年 | 17篇 |
1994年 | 7篇 |
1993年 | 5篇 |
1992年 | 6篇 |
1991年 | 8篇 |
1990年 | 5篇 |
1989年 | 4篇 |
1988年 | 7篇 |
1987年 | 4篇 |
1986年 | 9篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 3篇 |
1977年 | 3篇 |
1971年 | 1篇 |
1969年 | 1篇 |
1959年 | 5篇 |
排序方式: 共有3999条查询结果,搜索用时 15 毫秒
11.
《Comptes Rendus Mecanique》2019,347(11):780-792
The present work aims at proposing a new methodology for learning reduced models from a small amount of data. It is based on the fact that discrete models, or their transfer function counterparts, have a low rank and then they can be expressed very efficiently using few terms of a tensor decomposition. An efficient procedure is proposed as well as a way for extending it to nonlinear settings while keeping limited the impact of data noise. The proposed methodology is then validated by considering a nonlinear elastic problem and constructing the model relating tractions and displacements at the observation points. 相似文献
12.
A new family of proximity graphs: Class cover catch digraphs 总被引:1,自引:0,他引:1
Jason DeVinney 《Discrete Applied Mathematics》2006,154(14):1975-1982
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs—class cover catch digraphs (CCCDs). CCCDs are a special case of catch digraphs. Solving the underlying CCP is equivalent to finding a smallest cardinality dominating set for the associated CCCD, which in turn provides regularization for statistical pattern classification. Some relevant properties of CCCDs are studied and a characterization of a family of CCCDs is given. 相似文献
13.
CUI Xiao-bing ZHENG Shou-tian SUN Yan-qiong YANG Guo-yu ** . Coordination Hydrothermal Chemistry Group State Key Laboratory of Structural Chemistry Fujian Institute of Research on the Structure of Matter Chinese Academy of Sciences Fuzhou P. R. China . State Key Laboratory of Coordination Chemistry Najing University Nanjing P. R. China 《高等学校化学研究》2004,(1)
IntroductionPolyoxometalatesarewidelystudiedfortheirin terestingapplicationsincatalysis ,electronicconduc tivity ,magnetism ,nonlinearopticsandmedicine[1— 4 ] .Whilethemechanismofthesynthesisofpolyoxometalatesremainselusiveandisoftende scribedasself assembly ,thereseemstobeanincreas inguseofthecombinationofthehydrothermalmethodandthestructure directingtemplate .There searchwiththismethodhasdemonstratedthatanum beroftransitionmetaloxides ,typicallyreducedmolybdenumoxides ,mixedvalancevanadiumo… 相似文献
14.
优化设计性实验教学培养学生的科学素质 总被引:13,自引:2,他引:11
通过论证设计性实验与科学素质之间的关系,提出体现培养科学素质的问题式学习模式,并在大学物理实验教学中进行了教学改革试验。 相似文献
15.
Nobuyuki Hanaki 《Complexity》2004,9(5):41-50
This article seeks to ascertain whether the strategy‐learning model of Hanaki, Sethi, Erev, and Peterhansl (2003) better accounts for observed behavior than do the various action‐learning models. It does so by measuring the goodness‐of‐fit of the models' predictions against published experimental results for such games as Coordination, Prisoner's Dilemma, and Chicken. The fit is measured via the mean squared deviation (MSD) between the observed behavior and the one predicted by the model. The results show that, for Chicken, the strategy‐learning model fits the observed data much better than do the action‐learning models. The best action‐learning model, on the other hand, fits the observed data well in Coordination. Overall, the strength of the strategy‐learning model is best shown in games where alternations between the two stage‐game Nash equilibria are often observed in the laboratory experiments. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–50, 2004 相似文献
16.
A new type of optoelectronic cellular neural network has been developed by providing the capability of coefficients adjusment of cellular neural network (CNN) using Widrow based perceptron learning algorithm. The new supervised cellular neural network is called Widrow-CNN. Despite the unsupervised CNN, the proposed learning algorithm allows to use the Widrow-CNN for various image processing applications easily. Also, the capability of CNN for image processing and feature extraction has been improved using basic joint transform correlation architecture. This hardware application presents high speed processing capability compared to digital applications. The optoelectronic Widrow-CNN has been tested for classic CNN feature extraction problems. It yields the best results even in case of hard feature extraction problems such as diagonal line detection and vertical line determination. 相似文献
17.
Decentralized iterative learning control for a class of large scale interconnected dynamical systems
Hansheng Wu 《Journal of Mathematical Analysis and Applications》2007,327(1):233-245
The problem of decentralized iterative learning control for a class of large scale interconnected dynamical systems is considered. In this paper, it is assumed that the considered large scale dynamical systems are linear time-varying, and the interconnections between each subsystem are unknown. For such a class of uncertain large scale interconnected dynamical systems, a method is presented whereby a class of decentralized local iterative learning control schemes is constructed. It is also shown that under some given conditions, the constructed decentralized local iterative learning controllers can guarantee the asymptotic convergence of the local output error between the given desired local output and the actual local output of each subsystem through the iterative learning process. Finally, as a numerical example, the system coupled by two inverted pendulums is given to illustrate the application of the proposed decentralized iterative learning control schemes. 相似文献
18.
Optimization theory provides a framework for determining the best decisions or actions with respect to some mathematical model of a process. This paper focuses on learning to act in a near-optimal manner through reinforcement learning for problems that either have no model or the model is too complex. One approach to solving this class of problems is via approximate dynamic programming. The application of these methods are established primarily for the case of discrete state and action spaces. In this paper we develop efficient methods of learning which act in complex systems with continuous state and action spaces. Monte-Carlo approaches are employed to estimate function values in an iterative, incremental procedure. Derivative-free line search methods are used to obtain a near-optimal action in the continuous action space for a discrete subset of the state space. This near-optimal control policy is then extended to the entire continuous state space via a fuzzy additive model. To compensate for approximation errors, a modified procedure for perturbing the generated control policy is developed. Convergence results under moderate assumptions and stopping criteria are established. 相似文献
19.
用核磁共振对非晶态中B3+离子的微观结构进行了测定,结合Raman光谱的研究,对Li2O-B2O3-P2O5系统非晶态的性能(电导率、密度等)在P2O5/B2O3比约等于1时产生极值的原因从理论上作了阐明。 相似文献
20.
It is proposed that continuous time is in effect discretized in the brain by dynamic pattern recognition mechanisms in neurons. Time discretization is required to support formal computations in continuous time systems consisting of a large number of components. The ability to perform formal computations is necessary if the system is to execute high level algorithms of the type used in present day artificial intelligence. The weakness of such algorithms is that they work efficiently only when the forms of patterns and objects presented to them are highly constrained. The dynamic mechanisms which discretize the brain's time line also serve to code patterns into constrained forms suitable for high level processing. 相似文献